On the Comparison of Sufficient Conditions for the Real and Symmetric Nonnegative Inverse Eigenvalue Problems

نویسندگان

  • Carlos Marijuán
  • C. Marijuán
  • M. Pisonero
چکیده

The real nonnegative inverse eigenvalue problem (RNIEP) is the problem of characterizing all possible real spectra of entrywise nonnegative matrices. This problem remains unsolved. Since the first result in this area announced by Suleimanova in 1949 and proved by Perfect in 1953, a number of realizability criteria or sufficient conditions for the existence of a nonnegative matrix with a given real spectrum have been obtained, from different points of view. In [2] the authors construct a map of sufficient conditions for the RNIEP, in which they show inclusion or independency relations between these conditions. If in the RNIEP we require that the nonnegative matrix be symmetric, we have the symmetric nonnegative inverse eigenvalue problem (SNIEP). The first known sufficient condition for the SNIEP is due to Perfect and Mirsky in 1965 for doubly stochastic matrices, and Fiedler gave in 1974 the first symmetric realizability criteria for nonnegative matrices. It is well known that these two problems are equivalent for spectra of size n ≤ 4 and a complete solution of both is known only for n ≤ 4. For n ≥ 5 they are different and both problems remain open. Given a real spectrum σ verifying a sufficient condition X, we introduce the X-margin of realizability of σ to measure how much we can decrease the spectral radius of σ preserving the sufficient condition X. We analyze several sufficient conditions from the point of view of their margin of realizability [1]. Since 2007 new sufficient conditions for the RNIEP have appeared. We discuss new relations of inclusion or independency between these new sufficient conditions and the previous ones studied in [3]. We also construct a map of sufficient conditions for the SNIEP [4]. Finally, we describe and discuss some open problems of interest in this context.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the nonnegative inverse eigenvalue problem of traditional matrices

In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.

متن کامل

Some results on the symmetric doubly stochastic inverse eigenvalue problem

‎The symmetric doubly stochastic inverse eigenvalue problem (hereafter SDIEP) is to determine the necessary and sufficient conditions for an $n$-tuple $sigma=(1,lambda_{2},lambda_{3},ldots,lambda_{n})in mathbb{R}^{n}$ with $|lambda_{i}|leq 1,~i=1,2,ldots,n$‎, ‎to be the spectrum of an $ntimes n$ symmetric doubly stochastic matrix $A$‎. ‎If there exists an $ntimes n$ symmetric doubly stochastic ...

متن کامل

On nonnegative realization of partitioned spectra

We consider partitioned lists of real numbers Λ = {λ1, λ2, . . . , λn}, and give efficient and constructive sufficient conditions for the existence of nonnegative and symmetric nonnegative matrices with spectrum Λ. Our results extend the ones given in [R.L. Soto and O. Rojo. Applications of a Brauer theorem in the nonnegative inverse eigenvalue problem. Linear Algebra Appl., 416:844– 856, 2006....

متن کامل

Ela on Nonnegative

We consider partitioned lists of real numbers Λ = {λ1, λ2, . . . , λn}, and give efficient and constructive sufficient conditions for the existence of nonnegative and symmetric nonnegative matrices with spectrum Λ. Our results extend the ones given in [R.L. Soto and O. Rojo. Applications of a Brauer theorem in the nonnegative inverse eigenvalue problem. Linear Algebra Appl., 416:844– 856, 2006....

متن کامل

The inverse eigenvalue problem via orthogonal matrices

In this paper we study the inverse eigenvalue problem for symmetric special matrices and introduce sufficient conditions for obtaining nonnegative matrices. We get the HROU algorithm from [1] and introduce some extension of this algorithm. If we have some eigenvectors and associated eigenvalues of a matrix, then by this extension we can find the symmetric matrix that its eigenvalue and eigenvec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015